Regularization of multiplicative iterative algorithms with nonnegative constraint
نویسندگان
چکیده
This paper studies the regularization of constrained Maximum Likelihood iterative algorithms applied to incompatible ill-posed linear inverse problems. Specifically we introduce a novel stopping rule which defines a regularization algorithm for the Iterative Space Reconstruction Algorithm in the case of Least-Squares minimization. Further we show that the same rule regularizes the Expectation Maximization algorithm in the case of Kullback-Leibler minimization provided a welljustified modification of the definition of Tikhonov regularization is introduced. The performances of this stopping rule are illustrated in the case of an image reconstruction problem in X-ray solar astronomy. Regularization of multiplicative iterative algorithms 2
منابع مشابه
Multiplicative algorithms for maximum penalized likelihood inversion with nonnegative constraints and generalized error distributions
In many linear inverse problems the unknown function f (or its discrete approximation θp×1), which needs to be reconstructed, is subject to the nonnegative constraint(s); we call these problems the nonnegative linear inverse problems (NNLIPs). This paper considers NNLIPs. However, the error distribution is not confined to the traditional Gaussian or Poisson distributions. We adopt the exponenti...
متن کاملMultiplicative nonnegative graph embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the specific purpose characterized by the intrinsic and penalty graphs [13]. Our contributions are two-fold. On the one hand, we present a multiplicative iterative procedure for nonnegative graph embedding, which significantly ...
متن کاملRobust nonnegative matrix factorization via L1 norm regularization by multiplicative updating rules
Nonnegative Matrix Factorization (NMF) is a widely used technique in many applications such as face recognition, motion segmentation, etc. It approximates the nonnegative data in an original high dimensional space with a linear representation in a low dimensional space by using the product of two nonnegative matrices. In many applications data are often partially corrupted with large additive n...
متن کاملKernel nonnegative matrix factorization without the curse of the pre-image
The nonnegative matrix factorization (NMF) is widely used in signal and image processing, including bio-informatics, blind source separation and hyperspectral image analysis in remote sensing. A great challenge arises when dealing with a nonlinear formulation of the NMF. Within the framework of kernel machines, the models suggested in the literature do not allow the representation of the factor...
متن کاملMultiplicative Updates for Learning with Stochastic Matrices
Stochastic matrices are arrays whose elements are discrete probabilities. They are widely used in techniques such as Markov Chains, probabilistic latent semantic analysis, etc. In such learning problems, the learned matrices, being stochastic matrices, are non-negative and all or part of the elements sum up to one. Conventional multiplicative updates which have been widely used for nonnegative ...
متن کامل